Approximate Sparse Decomposition Based on Smoothed L0-Norm

نویسندگان

  • Hamed Firouzi
  • Masoud Farivar
  • Massoud Babaie-Zadeh
  • Christian Jutten
چکیده

In this paper, we propose a method to address the problem of source estimation for Sparse Component Analysis (SCA) in the presence of additive noise. Our method is a generalization of a recently proposed method (SL0), which has the advantage of directly minimizing the ℓ 0-norm instead of ℓ 1-norm, while being very fast. SL0 is based on minimization of the smoothed ℓ 0-norm subject to As = x. In order to better estimate the source vector for noisy mixtures, we suggest then to remove the constraint As = x, by relaxing exact equality to an approximation (we call our method Smoothed ℓ 0-norm Denois-ing or SL0DN). The final result can then be obtained by minimization of a proper linear combination of the smoothed ℓ 0-norm and a cost function for the approximation. Experimental results emphasize on the significant enhancement of the modified method in noisy cases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Joint Smoothed l0-Norm DOA Estimation Algorithm for Multiple Measurement Vectors in MIMO Radar

Direction-of-arrival (DOA) estimation is usually confronted with a multiple measurement vector (MMV) case. In this paper, a novel fast sparse DOA estimation algorithm, named the joint smoothed l 0 -norm algorithm, is proposed for multiple measurement vectors in multiple-input multiple-output (MIMO) radar. To eliminate the white or colored Gaussian noises, the new method first obtains a low-comp...

متن کامل

Fast Sparse Representation Based on Smoothed l0 Norm

In this paper, a new algorithm for Sparse Component Analysis (SCA) or atomic decomposition on over-complete dictionaries is presented. The algorithm is essentially a method for obtaining sufficiently sparse solutions of underdetermined systems of linear equations. The solution obtained by the proposed algorithm is compared with the minimum `-norm solution achieved by Linear Programming (LP). It...

متن کامل

Complex-valued sparse representation based on smoothed l0 norm

In this paper we present an algorithm for complex-valued sparse representation. In our previous work we presented an algorithm for Sparse representation based on smoothed norm. Here we extend that algorithm to complex-valued signals. The proposed algorithm is compared to FOCUSS algorithm and it is experimentally shown that the proposed algorithm is about two or three orders of magnitude faster ...

متن کامل

Compressed sensing MRI with combined sparsifying transforms and smoothed l0 norm minimization

Undersampling the k-space is an efficient way to speed up the magnetic resonance imaging (MRI). Recently emerged compressed sensing MRI shows promising results. However, most of them only enforce the sparsity of images in single transform, e.g. total variation, wavelet, etc. In this paper, based on the principle of basis pursuit, we propose a new framework to combine sparsifying transforms in c...

متن کامل

Smoothed l0 Norm Regularization for Sparse-View X-Ray CT Reconstruction

Low-dose computed tomography (CT) reconstruction is a challenging problem in medical imaging. To complement the standard filtered back-projection (FBP) reconstruction, sparse regularization reconstruction gains more and more research attention, as it promises to reduce radiation dose, suppress artifacts, and improve noise properties. In this work, we present an iterative reconstruction approach...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0811.2868  شماره 

صفحات  -

تاریخ انتشار 2008